Constructing Locally Connected Non-computable Julia Sets
نویسندگان
چکیده
A locally connected quadratic Siegel Julia set has a simple explicit topological model. Such a set is computable if there exists an algorithm to draw it on a computer screen with an arbitrary resolution. We constructively produce parameter values for Siegel quadratics for which the Julia sets are non-computable, yet locally connected.
منابع مشابه
Parabolic Julia Sets are Polynomial Time Computable
In this paper we prove that parabolic Julia sets of rational functions are locally computable in polynomial time.
متن کاملComputability of Julia Sets
In this paper we settle most of the open questions on algorithmic computability of Julia sets. In particular, we present an algorithm for constructing quadratics whose Julia sets are uncomputable. We also show that a filled Julia set of a polynomial is always computable.
متن کاملSome Rational Maps Whose Julia Sets Are Not Locally Connected
We describe examples of rational maps which are not topologically conjugate to a polynomial and whose Julia sets are connected but not locally connected. Introduction and motivations The dynamics of a rational map f acting on Ĉ is concentrated on its Julia set which is (by definition) the minimal compact set invariant by f and f−1 containing at least three points. The question of local connecti...
متن کاملA note on the structure of quadratic Julia sets
In a series of papers, Bandt and the author have given a symbolic and topological description of locally connected quadratic Julia sets by use of special closed equivalence relations on the circle called Julia equivalences. These equivalence relations reflect the landing behaviour of external rays in the case of local connectivity, and do not apply completely if a Julia set is connected but fai...
متن کاملSpiders’ Webs and Locally Connected Julia Sets of Transcendental Entire Functions
We show that, if the Julia set of a transcendental entire function is locally connected, then it takes the form of a spider’s web in the sense defined by Rippon and Stallard. In the opposite direction, we prove that a spider’s web Julia set is always locally connected at a dense subset of buried points. We also show that the set of buried points (the residual Julia set) can be a spider’s web.
متن کامل